On minimal imperfect graphs with circular symmetry
نویسندگان
چکیده
Results of Lovász and Padberg entail that the class of so-called partitionable graphs contains all the potential counterexamples to Berge’s famous Strong Perfect Graph Conjecture, which asserts that the only minimal imperfect graphs are the odd chordless cycles with at least five vertices (”odd holes”) and their complements (”odd antiholes”). Only two constructions (due to Chvátal, Graham, Perold and Whitesides) are known for making partitionable graphs. The first one does not produce any counterexample to Berge’s Conjecture, as shown by Sebő. Here we prove that the second one does not produce any counterexample either. This second construction is given by near-factorizations of cyclic groups based on the so-called ”British number systems” introduced by De Bruijn. All the partitionable graphs generated by this second construction (in particular odd holes and odd antiholes) have circular symmetry. No other partitionable graph with circular symmetry is known, and we conjecture that none exists; in this direction we prove that any counterexample must contain a clique and a stable set with at least six vertices each. Also we prove that every minimal imperfect graph with circular symmetry must have an odd number of vertices. ∗The second and third authors gratefully acknowledge the partial support by the Office of Naval Research (Grants N0001492F1375 and N0001492F4083) and by the Air Force Office of Scientific Research (Grant F49620-93-1-0041). The second author was also supported by NSF (grant INT 9321811) and NATO (grant CRG 931531). †Computer and Automation Institute, Hungarian Academy of Sciences, Kende u., Budapest, Hungary. E-mail: [email protected] ‡RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, USA. E-mail: [email protected] §RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, USA; On leave from the International Institute of Earthquake Prediction Theory and Mathematical Geophysics, Moscow, Russia. E-mail: [email protected] ¶CNRS, Laboratoire Leibniz, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France. E-mail: [email protected] ‖CNRS, Laboratoire Leibniz, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France. E-mail: [email protected]
منابع مشابه
On classes of minimal circular-imperfect graphs
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an important class of χ-bound graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G) + 1. The Strong Perfect Graph Conjecture, recently settled by Chudnovsky et al. [4], provides a characterization of perfect ...
متن کاملMinimal circular-imperfect graphs of large clique number and large independence number
This paper constructs some classes of minimal circular-imperfect graphs. In particular, it is proved that there are minimal circularimperfect graphs whose independence number and clique number are both arbitrarily large.
متن کاملClaw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کاملTriangle-free strongly circular-perfect graphs
Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [4]; in particular, perfect graphs are closed under complementation [7]. In...
متن کاملNew Results on Minimal Strongly Imperfect Graphs
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 1998